Rule Mining for Dynamic Databases
نویسندگان
چکیده
Association rules identify associations among data items and were introduced in 1993 by Agarwal et al.. Most of the algorithms to find association rules deal with the static databases. There are very few algorithms that deal with dynamic databases. The most classical algorithm to find association rules in dynamic database is Borders algorithm. This paper presents two modified version of the Borders algorithm called Modified Borders. Experimental results show that the modified version performs better than the Borders algorithm in terms of execution time. To address the scalability issue, the paper also proposes a distributed version of the Borders algorithm, called Distributed Borders.
منابع مشابه
Numeric Multi-Objective Rule Mining Using Simulated Annealing Algorithm
Abstract as a single objective one. Measures like support, confidence and other interestingness criteria which are used for evaluating a rule, can be thought of as different objectives of association rule mining problem. Support count is the number of records, which satisfies all the conditions that exist in the rule. This objective represents the accuracy of the rules extracted from the da...
متن کاملIncremental Association Rule Mining Through Vertical Transaction ID
Association rule mining is a popular data mining technique which gives us valuable relationships among different items in a dataset. In dynamic databases, new transactions are appended as time advances. This may introduce new association rules and some existing association rules would become invalid. Thus, the maintenance of association rules for dynamic databases is an important problem. Sever...
متن کاملA novel approach for incremental uncertainty rule generation from databases with missing values handling: application to dynamic medical databases.
Current approaches for mining association rules usually assume that the mining is performed in a static database, where the problem of missing attribute values does not practically exist. However, these assumptions are not preserved in some medical databases, like in a home care system. In this paper, a novel uncertainty rule algorithm is illustrated, namely URG-2 (Uncertainty Rule Generator), ...
متن کاملOptimization of Spatial Association Rule Mining using Hybrid Evolutionary Algorithm
Spatial data refer to any data about objects that occupy real physical space. Attributes within spatial databases usually include spatial information. Spatial data refers to the numerical or categorical values of a function at different spatial locations. Spatial metadata refers to the descriptions of the spatial configuration. Application of classical association rule mining concepts to spatia...
متن کاملCluster Based Association Rule Mining for Heart Attack Prediction
This Paper Focuses on Analyzing Medical Data using Association Rule mining for Heart Attack Prediction. Association rule mining is one of the fundamental research topics in data mining and knowledge discovery that finds interesting association or correlation relation ship among a large set of data items and predicts the associative and correlative behaviors for new data. The Association rule mi...
متن کاملDesign and Analysis of a Dynamic Load Balancing Strategy for Large-Scale Distributed Association Rule Mining
Association rule mining is one of the most important data mining techniques. Algorithms of this technique search a large space, considering numerous different alternatives and scanning the data repeatedly. Parallelism seems to be the natural solution in order to be able to work with industrial-sized databases. Large-scale computing systems, such as Grid computing environments, are recently rega...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. of Inf. Systems
دوره 13 شماره
صفحات -
تاریخ انتشار 2004